منابع مشابه
Offensive alliances in graphs
A set S is an offensive alliance if for every vertex v in its boundary N(S)−S it holds that the majority of vertices in v’s closed neighbourhood are in S. The offensive alliance number is the minimum cardinality of an offensive alliance. In this paper we explore the bounds on the offensive alliance and the strong offensive alliance numbers (where a strict majority is required). In particular, w...
متن کاملOffensive r-alliances in graphs
Let G = (V , E) be a simple graph. For a nonempty set X ⊂ V , and a vertex v ∈ V , δX (v) denotes the number of neighbors v has in X . A nonempty set S ⊂ V is an offensive r-alliance in G if δS(v) ≥ δS̄(v)+ r,∀v ∈ ∂(S), where ∂(S) denotes the boundary of S. An offensive ralliance S is called global if it forms a dominating set. The global offensive r-alliance number of G, denoted by γ o r (G), i...
متن کاملDo Offensive Words Harm People?
The harm thesis—the assumption that words harm people—is a defining feature of sexual harassment, hate speech, verbal abuse, and obscene telephone call (OTC) offenses. This thesis ignores the possibility that swearing can be advantageous, cathartic, or an acceptable substitute for physical aggression. Observational data, courtroom evidence and verbal abuse research reviewed here produce conflic...
متن کاملModeling offensive player movement in professional basketball
The 2013 arrival of SportVU player tracking data in all NBA arenas introduced an overwhelming amount of on-court information information which the league is still learning how to maximize for insights into player performance and basketball strategy. Knowing where the ball and every player on the court are at all times throughout the course of the game produces almost endless possibilities, and ...
متن کاملConnected global offensive k-alliances in graphs
We consider finite graphs G with vertex set V (G). For a subset S ⊆ V (G), we define by G[S] the subgraph induced by S. By n(G) = |V (G)| and δ(G) we denote the order and the minimum degree of G, respectively. Let k be a positive integer. A subset S ⊆ V (G) is a connected global offensive k-alliance of the connected graphG, ifG[S] is connected and |N(v)∩S| ≥ |N(v)−S|+k for every vertex v ∈ V (G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anaesthesia
سال: 2002
ISSN: 0003-2409
DOI: 10.1046/j.1365-2044.2002.02752_27.x